Software for testing stability polynomials
نویسندگان
چکیده
منابع مشابه
Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملA Tabular Algorithm for Testing the Robust Hurwitz Stability of Convex Combinations of Complex Polynomials
In this paper we present a tabular algorithm for testing the Hurwitz property of a segment of complex polynomials. The algorithm consists in constructing a parametric Routhlike array with polynomial entries and generating Sturm sequences for checking the absence of zeros of two real polynomials in the interval (0,1). The presented algorithm is easy to implement. Moreover, it accomplishes the te...
متن کاملA circular stability test for general polynomials *
Abstruct: We extend a new stability test proposed recently for discrete system polynomials [l] to polynomials with complex coefficients. The method is based on a three-term recursion of a conjugate symmetric sequence of polynomials. The complex version has the same relative improved efficiency as the real version in comparison to the classical Schur-Cohn formulation for counting the number of z...
متن کاملStability Optimization for Polynomials and Matrices
Suppose that the coefficients of a monic polynomial or entries of a square matrix depend affinely on parameters, and consider the problem of minimizing the root radius (maximum of the moduli of the roots) or root abscissa (maximum of their real parts) in the polynomial case and the spectral radius or spectral abscissa in the matrix case. These functions are not convex and they are typically not...
متن کاملSome Stability Theorems for Polygons of Polynomials
-, “Generalized Riccati equations for two-point boundaly value descriptor systems,” in Proc. 26th IEEE Conf: Decision Contr., Los Angeles, CA, 1987. H. E. Rauch, F. Tung, and C. T. Striebel, “Maximum likelihood estimates of linear systems,” J. AZAA, vol. 3, pp. 1445-1450, 1965. L. R. Riddle and H. L. Weinert, “Fast algorithms for the reconstruction of images from hyperbolic systems,” in Proc. 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1982
ISSN: 0307-904X
DOI: 10.1016/0307-904x(82)90013-0